Matroids vs. Shifted simplicial complexes

نویسندگان

  • José Alejandro Samper
  • Steven Klee
چکیده

The families of matroid independence complexes and pure shifted simplicial complexes are two remarkable classes of simplicial complexes that share several structural properties, but for which theorems are typically proved in different ways. In a groundbreaking paper Kook, Reiner and Stanton [4] proved that matroid complexes are Laplacian integral. Afterwards Duval and Reiner [1] proved the analogue of this result for shifted complexes using completely different techniques. Finally, Duval [2] proved that the Laplacians of both families of complexes satisfy the same (relative) deletion contraction recurrence. It is then reasonable to ask whether there is a natural class of simplicial complexes that bridges these two theories. We propose an approach that aims to construct such a class of simplicial complexes. The idea is to relax the classical cryptomorphic matroid axioms to obtain various classes of ordered complexes that contain both the pure shifted complexes and matroids. Each of these classes inherits some nice properties of matroids and, surprisingly, the complexes in the intersection of the mentioned classes enjoy enjoy even more analogue properties of classical matroid theory. We describe two such classes here: the first one is obtained by relaxing the exchange axiom, while the second one is obtained by relaxing the circuit axiom. We then proceed to study properties in the intersection of these two classes: they admit natural shelling orders, a notion of internal and external activities, and a well behaved theory of Tutte-Grothendieck invariants with a corresponding Tutte polynomial. In what follows, ∆ is a pure finite (d− 1)-simplicial complex. We distinguish between the ground set of ∆, which we call E, and the set of vertices which we call V . It is always true that V ⊆ E, but it is possible to have some e ∈ E for which {e} / ∈ ∆. We also assume that E comes endowed with a total order.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relaxations of the matroid axioms I: Independence, Exchange and Circuits

Motivated by a question of Duval and Reiner about higher Laplacians of simplicial complexes, we describe various relaxations of the defining axioms of matroid theory to obtain larger classes of simplicial complexes that contain pure shifted simplicial complexes. The resulting classes retain some of the matroid properties and allow us to classify matroid properties according to the relevant axio...

متن کامل

A Common Recursion for Laplacians of Matroids and Shifted Simplicial Complexes

A recursion due to Kook expresses the Laplacian eigenvalues of a matroid M in terms of the eigenvalues of its deletion M−e and contraction M/e by a fixed element e, and an error term. We show that this error term is given simply by the Laplacian eigenvalues of the pair (M−e, M/e). We further show that by suitably generalizing deletion and contraction to arbitrary simplicial complexes, the Lapla...

متن کامل

Minors of simplicial complexes

We extend the notion of a minor from matroids to simplicial complexes. We show that the class of matroids, as well as the class of independence complexes, is characterized by a single forbidden minor. Inspired by a recent result of Aharoni and Berger, we investigate possible ways to extend the matroid intersection theorem to simplicial complexes.

متن کامل

Dirac’s Theorem on Simplicial Matroids

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higherdimensional analogue of clique (or flag) complexes (case k = 2) and they are a rich new class of simplicial complexes. We show that Dirac’s theorem on chordal graphs has a higher-dimensional analogue in which graphs and clique ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015